12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013

نویسندگان

  • Rainer Schrader
  • Stefano Coniglio
  • Ekrem Duman
  • Ahmet Altun
  • Azumi Igarashi
  • Yoshitsugu Yamamoto
  • Djamal Rebaine
  • Alain Quilliot
  • Haiko Müller
  • Sam Wilson
  • Xavier Molinero
  • Fabián Riquelme
  • Maria Serna
  • Giulia Galbiati
  • Diana Sasaki
چکیده

Locations Sessions. All technical sessions take place in the Vrijhof (building 47 on the campus map) in the lecture halls Amphitheater and Audiozaal. Internet You can use " eduroam " to connect to the internet. If you have internet access in your hotel on the campus and have obtained an account for that purpose, you can use the " UT Guest " network. If neither of these options works, you can use the computer in front of the lecture halls.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013)

Weare pleased to present this special issue ofDiscrete AppliedMathematics, which is devoted to the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2013), held at the University of Twente, Enschede, The Netherlands, between May 21 and May 23, 2013. More than 80 scientists from all over the world attended the workshop, and we take this opportunity to thank all CTW 2013 ...

متن کامل

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009

We present two approaches for the Euclidean TSP which compute high quality tours for large instances. Both approaches are based on pseudo backbones consisting of all common edges of good tours. The first approach starts with some pre-computed good tours. Using this approach we found record tours for seven VLSI instances. The second approach is window based and constructs from scratch very good ...

متن کامل

CTW 16 14 th Cologne - Twente Workshop on Graphs and Combinatorial Optimization Università degli

The shared broadcast tree (SBT) problem in Euclidean graphs resembles the minimum spanning tree (MST) problem, but differs from MST in the definition of the objective function. The SBT problem is known to be NP-hard. In the current work, we analyse how closely the MST-solution approximates the SBT-solution, and we prove in particular that the approximation ratio is at least 6. Further, we condu...

متن کامل

MRI Mouse Brain Data of Ischemic Lesion after Transient Middle Cerebral Artery Occlusion

1 Department of Neurology, Leiden University Medical Center, Leiden, Netherlands, 2 Division of Image Processing (LKEB), Department of Radiology, Leiden University Medical Center, Leiden, Netherlands, 3 Percuros B.V., Department of Developmental Bio-Engineering, University of Twente, Enschede, Netherlands, 4 Department of Radiation Oncology, Netherlands Cancer Institute, Amsterdam, Netherlands,...

متن کامل

The Conceptual MADE Framework for Pervasive and Knowledge-Based Decision Support in Telemedicine

25 The Conceptual MADE Framework for Pervasive and Knowledge-Based Decision Support in Telemedicine Nick L. S. Fung, University of Twente, Enschede, Netherlands Valerie M. Jones, University of Twente, Enschede, Netherlands Ing Widya, University of Twente, Enschede, Netherlands Tom H. F. Broens, Academic Medical Center, Amsterdam, Netherlands Nekane Larburu, University of Twente, Enschede, Nethe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره WP 13-01  شماره 

صفحات  -

تاریخ انتشار 2013